One-shot set-membership identification of Wiener models with polynomial nonlinearities
نویسندگان
چکیده
منابع مشابه
Set-membership Identification of Wiener Models with Non-invertible Nonlinearity
In this paper the identification of SISO Wiener models in presence of bounded output noise is considered. A three stage procedure based on the inner signal estimation, outlined in a previous contribution, has been proposed. Results and algorithms for the computation of inner-signal bounds through the design of a suitable input sequence have been provided for the case of polynomial without inver...
متن کاملRecursive Identification of Wiener Systems with Two–segment Polynomial Nonlinearities
For the subclasses of nonlinear dynamic systems which can be considered as block oriented systems [8] there exist several identification methods using topologically identical models. One of the simplest nonlinear models of this category is the so-called Wiener model consisting of one linear dynamic block and one nonlinear static block. The Wiener models appear in many engineering applications [...
متن کاملParameter bounds evaluation of Wiener models with noninvertible polynomial nonlinearities
In this paper a three stage procedure is presented for deriving parameters bounds of SISOWiener models when the nonlinear block is modeled by a possibly noninvertible polynomial and the output measurement errors are bounded. First, using steady-state input–output data, parameters of the nonlinear part are bounded by a tight orthotope. Then, given the estimated uncertain nonlinearity and the out...
متن کاملIdentification of Wiener Systems With Known Noninvertible Nonlinearities
In this paper we develop a method for identifying SISO Wiener-type nonlinear systems, that is, systems consisting of a linear dynamic system followed by a static nonlinearity. Unlike previous techniques developed for Wiener system identification, our approach allows the identification of systems with nonlinearities that are known but not necessarily invertible, continuous, differentiable, or an...
متن کاملComputational complexity analysis of set membership identification of Hammerstein and Wiener systems
This paper analyzes the computational complexity of set membership identification of Hammerstein and Wiener systems. Its main results show that, even in cases where a portion of the plant is known, the problems are generically NP-hard both in the number of experimental data points and in the number of inputs (Wiener) or outputs (Hammerstein) of the nonlinearity. These results provide new insigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.12.254